Formulas for cube roots in F3m
نویسندگان
چکیده
We determine the number of nonzero coefficients (called the Hamming weight) in the polynomial representation of x in F3m = F3[x]/(f), where f ∈ F3[x] is an irreducible trinomial.
منابع مشابه
A note on efficient computation of cube roots in characteristic 3
The cost of the folklore algorithm for computing cube roots in F3m in standard polynomial basis is less that one multiplication, but still O(m). Here we show that, if F3m is represented in trinomial basis as F3[x]/(x + ax + b) with a, b = ±1, the actual cost of computing cube roots in F3m is only O(m).
متن کاملExplicit formulas for efficient multiplication in F_{3^{6m}}
Abstract. Efficient computation of the Tate pairing is an important part of pairing-based cryptography. Recently with the introduction of the Duursma-Lee method special attention has been given to the fields of characteristic 3. Especially multiplication in F36m , where m is prime, is an important operation in the above method. In this paper we propose a new method to reduce the number of F3m -...
متن کاملSoftware Implementation of Arithmetic in F3m
Fast arithmetic for characteristic three finite fields F3m is desirable in pairing-based cryptography because there is a suitable family of elliptic curves over F3m having embedding degree 6. In this paper we present some structure results for Gaussian normal bases of F3m , and use the results to devise faster multiplication algorithms. We carefully compare multiplication in F3m using polynomia...
متن کاملHyper-tubes of hyper-cubes
Hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.
متن کاملPairing in Characteristic Three
Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. Software implementations being rather slow, the study of hardware architectures became an active research area. In this paper, we discuss several algorithms to compute the ηT pairing in characteristic three and suggest further impr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 155 شماره
صفحات -
تاریخ انتشار 2007